Extended RDF: Computability and complexity issues
نویسندگان
چکیده
منابع مشابه
Computability and Complexity Issues of Extended RDF
ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. Unfortunately, ERDF stable model semantics is in general undecidable. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics.
متن کاملOn the Computability and Complexity Issues of Extended RDF
ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics. We show that decidability under this semantics cannot be achieved, unless ERDF ontologies of restricted syntax are considered. Therefore, we propose a ...
متن کاملComputability and Complexity
ion Abstraktion Acceptance problem Akzeptanz-Problem Accepted akzeptiert Accepting state akzeptierender Zustand Ackermann function Ackermann-Funktion Algorithm Algorithmus Alphabet Alphabet Ambiguity problem Zweideutigkeitsproblem Amortized analysis amortisierte Analyse Application Anwendung Argument (Funktions-)Argument Automaton (endlicher) Automat Automaton language (L(M)) die Sprache eines ...
متن کاملHonest Computability and Complexity
Computations manipulate representations of objects, most often strings of symbols taken from some finite alphabet, rather than the objects themselves. Numbers, for example, are usually denoted by sequences of decimal, or binary, or unary digits. In logic, one therefore distinguishes between numbers n, which reside in an ideal Platonic world, and numerals ⌜n⌝, their symbolic representation as (f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 2015
ISSN: 1012-2443,1573-7470
DOI: 10.1007/s10472-015-9451-0